Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints
نویسندگان
چکیده
We evoke our model of strict periodic systems with precedence constraints and our model of architecture. We prove that the problem of multiprocessor scheduling of these systems is NP-hard. We give some theoretical results which allows us to propose a heuristic to solve this problem and we compare its performances to those of an exact algorithm of type “branch & bound”.
منابع مشابه
Non-preemptive multiprocessor static scheduling for systems with precedence and strict periodicity constraints
In this paper we propose a greedy heuristic to solve the non preemptive multiprocessor static scheduling problem with precedence and strict periodicity constraints. The system of periodic tasks is described by a graph where dependent tasks are connected by precedence constraints. First, each task is repeated within the LCM of all periods of tasks (hyper-period) allowing to unroll the graph over...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملSchedulability Analysis for non Necessarily Harmonic Real-Time Systems with Precedence and Strict Periodicity Constraints using the Exact Number of Preemptions and no Idle Time
Scheduling theory as it applies to hard real-time environments with precedence and strict periodicity constraints — environments where the failure to satisfy any constraint may have disastrous consequences [1], [2] — seems currently to be enjoying a renaissance. The most widely studied problems in this field concern periodic non-preemptive tasks for systems where data are collected throught cap...
متن کاملScheduling Algorithms for Real-Time Systems
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the characteristics and constraints of real-time tasks which should be scheduled to be executed. Analysis methods and the concept of optimality criteria, which leads to design appropriate scheduling algorithms, wi...
متن کاملStatic multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs
The problem of allocating and scheduling realtime tasks, with Precedence Constraints and Communication Costs, on a multiprocessor architecture in order to meet the timing constraints is known to be NP-complete. Due to the growing complexity of real-time applications there is a need to find scheduling methods that can handle large task sets in a reasonable time. Also, scheduling methods should c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004